Solving Large‐Scale Linear Systems of Equations by a Quantum Hybrid Algorithm
نویسندگان
چکیده
Today's intermediate-scale quantum computers, although imperfect, already perform computational tasks that are manifestly beyond the capabilities of modern classical supercomputers. However, so far, quantum-enabled large-scale solutions have been realized only for limited set problems. Here a hybrid algorithm based on phase estimation and optimization circuit width depth is employed solving specific class large linear systems equations ubiquitous to many areas science engineering. A classification entanglement properties associated phase-estimation unitary operation introduced, enabling highly efficient search facilitated by straightforward matrix-to-circuit map. 217-dimensional problem implemented several IBM computer superconducting processors, record-breaking result system solved computer. Demonstrated realisation sets clear benchmark in quest future speedup solution.
منابع مشابه
A matrix LSQR algorithm for solving constrained linear operator equations
In this work, an iterative method based on a matrix form of LSQR algorithm is constructed for solving the linear operator equation $mathcal{A}(X)=B$ and the minimum Frobenius norm residual problem $||mathcal{A}(X)-B||_F$ where $Xin mathcal{S}:={Xin textsf{R}^{ntimes n}~|~X=mathcal{G}(X)}$, $mathcal{F}$ is the linear operator from $textsf{R}^{ntimes n}$ onto $textsf{R}^{rtimes s}$, $ma...
متن کاملSolving a System of Linear Equations by Homotopy Analysis Method
In this paper, an efficient algorithm for solving a system of linear equations based on the homotopy analysis method is presented. The proposed method is compared with the classical Jacobi iterative method, and the convergence analysis is discussed. Finally, two numerical examples are presented to show the effectiveness of the proposed method.
متن کاملQuantum algorithm for linear systems of equations.
Solving linear systems of equations is a common problem that arises both on its own and as a subroutine in more complex problems: given a matrix A and a vector b(-->), find a vector x(-->) such that Ax(-->) = b(-->). We consider the case where one does not need to know the solution x(-->) itself, but rather an approximation of the expectation value of some operator associated with x(-->), e.g.,...
متن کاملSolving systems of linear equations on a quantum computer
Stefanie Barz, Ivan Kassal, Martin Ringbauer1,∗, Yannick Ole Lipp, Borivoje Dakić, Alán Aspuru-Guzik, Philip Walther 1 Faculty of Physics, University of Vienna, Boltzmanngasse 5, 1090 Vienna, Austria 2 Department of Chemistry and Chemical Biology, Harvard University, Cambridge MA 02138, United States 3 Centre for Engineered Quantum Systems, Centre for Quantum Computing and Communication Technol...
متن کاملVariable time amplitude amplification and a faster quantum algorithm for solving systems of linear equations
We present two new quantum algorithms. Our first algorithm is a generalization of amplitude amplification to the case when parts of the quantum algorithm that is being amplified stop at different times. Our second algorithm uses the first algorithm to improve the running time of Harrow et al. algorithm for solving systems of linear equations from O(κ logN) to O(κ log κ logN) where κ is the cond...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annalen der Physik
سال: 2022
ISSN: ['1521-3889', '0003-3804']
DOI: https://doi.org/10.1002/andp.202200082